package com.shawn.leetcode.dynamicprogramming.minPathSum;

public interface Solution {

	int minPathSum(int[][] grid) ;

}
